全文获取类型
收费全文 | 194篇 |
免费 | 31篇 |
国内免费 | 4篇 |
出版年
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 9篇 |
2012年 | 14篇 |
2011年 | 6篇 |
2010年 | 14篇 |
2009年 | 15篇 |
2008年 | 16篇 |
2007年 | 20篇 |
2006年 | 17篇 |
2005年 | 9篇 |
2004年 | 16篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有229条查询结果,搜索用时 15 毫秒
71.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
72.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
73.
74.
韩德 《装甲兵工程学院学报》2006,20(1):94-98
将指派问题的匈牙利解法用于货郎担问题,通过恰当地添加大正数构造效率矩阵,得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程,该算法具有一定的实用性。 相似文献
75.
网络化作战C2组织结构的一种分析设计方法 总被引:1,自引:1,他引:0
网络化作战条件下,传统的层次型C2组织限制了组织成员之间的信息交互,难以适应复杂多变的作战环境,影响了系统整体作战效能的发挥。通过分解单个组织节点智能体(Agent)的行为过程,结合网络化作战的概念,在引入信息流、指控流因素情况下,研究在网络化作战中C2组织结构网络,并在分析组织网络探测信息/指控命令的传输和处理的基础上,提出了一种C2组织结构设计方法。该方法充分考虑了网络化作战探测信息共享以及指控命令协同,并将网络化作战C2组织的最优设计问题转化为C2组织网络中探测信息和指控命令的最小费用最大流问题。 相似文献
76.
根据《中国人民解放军环境保护条例》,军事设施建设项目应进行环境影响评价。由于军事项目建设内容高度机密、国防需要迫切、建设时间紧迫等,再加上一些从事军事设施项目建设的管理人员对环境影响评价的理解还存在某些偏差,使许多军事设施建设项目未进行环境影响评价,影响了我军的环境保护工作。简要介绍了军事设施的范围及军事设施建设项目的环境影响评价概况,结合军事设施建设项目环境影响评价中出现的一些问题,提出了进行军事设施建设项目环境影响评价工作的几点建议。 相似文献
77.
This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000 相似文献
78.
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999 相似文献
79.
We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003. 相似文献
80.